| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 8JMKD3MGPBW4/35S5BGL |
| Repository | sid.inpe.br/sibgrapi@80/2009/08.17.15.30 |
| Last Update | 2009:08.17.15.30.55 (UTC) administrator |
| Metadata Repository | sid.inpe.br/sibgrapi@80/2009/08.17.15.30.56 |
| Metadata Last Update | 2022:06.14.00.13.55 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2009.43 |
| Citation Key | KörbesLotu:2009:AnWaAl |
| Title | Analysis of the watershed algorithms based on the Breadth-First and Depth-First exploring methods  |
| Format | Printed, On-line. |
| Year | 2009 |
| Access Date | 2024, Apr. 28 |
| Number of Files | 1 |
| Size | 285 KiB |
| 2. Context | |
| Author | 1 Körbes, André 2 Lotufo, Roberto de Alencar |
| Affiliation | 1 UNICAMP 2 UNICAMP |
| Editor | Nonato, Luis Gustavo Scharcanski, Jacob |
| e-Mail Address | andre.korbes@gmail.com |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 22 (SIBGRAPI) |
| Conference Location | Rio de Janeiro, RJ, Brazil |
| Date | 11-14 Oct. 2009 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| History (UTC) | 2010-08-28 20:03:24 :: andre.korbes@gmail.com -> administrator :: 2022-06-14 00:13:55 :: administrator -> :: 2009 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | watershed transform image segmentation watershed algorithms |
| Abstract | In this paper, fifteen watershed algorithms are reviewed. For clarity, first we expose two graph exploring methods modified to be guidelines for understanding the approaches taken by these algorithms: the breadth-first watershed and the depth-first watershed. Both paradigms rely on the visiting order applied by the algorithms. The breadth-first is more recognisable as a seed region growing or marker expansion process, grouping both methods based on flooding and hierarchical queue. The depth-first groups the algorithms based on the drop of water simulation, forming a simple path until a regional minimum is found. We analyse and classify fifteen algorithms, and two of them were better characterised. Along with this, some useful information (i.e. use of markers and line over pixel) is organised, in order to facilitate the choice of an algorithm. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2009 > Analysis of the... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Analysis of the... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/8JMKD3MGPBW4/35S5BGL |
| zipped data URL | http://urlib.net/zip/8JMKD3MGPBW4/35S5BGL |
| Language | en |
| Target File | PID949619.pdf |
| User Group | andre.korbes@gmail.com |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46SJQ2S 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.14.19.43 3 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |